A Low Overhead Reachability Guaranteed Dynamic Route Discovery Mechanism for Dense MANETs

نویسندگان

  • Sharmila Sankar
  • V. Sankaranarayanan
چکیده

A crucial issue for a mobile ad hoc network is the handling of a large number of nodes. As more nodes join the mobile ad hoc network, contention and congestion are more likely. The on demand routing protocols which broadcasts control packets to discover routes to the destination nodes, generate a high number of broadcast packets in a larger networks causing contention and collision. We propose an efficient route discovery protocol, which reduces the number of broadcast packet, using controlled flooding technique. The simulation results show that the proposed probabilistic flooding decreases the number of control packets floating in the network during route discovery phase, without lowering the success ratio of path discoveries. Furthermore, the proposed method adapts to the normal network conditions. The results show that up to 70% of control packet traffic is saved in route discovery phase when the network is denser.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CARD: A Contact-based Architecture for Resource Discovery in Ad Hoc Networks

∗ A. Helmy was supported by NSF CAREER Award 0134650. Abstract Traditional protocols for routing in ad hoc networks attempt to obtain optimal (or shortest) paths, and in doing so may incur significant route discovery overhead. Such approaches may be appropriate for routing long-lived transfers where the initial cost of route discovery may be amortized over the life of the connection. For short-...

متن کامل

Enhancing the Performance of Adjusted Probabilistic Broadcast in MANETs

Probabilistic broadcast has been widely used as a flooding optimization mechanism to alleviate the effect of broadcast storm problem during route discovery and other services in mobile ad hoc networks (MANETs). In current dynamic probabilistic algorithms, the retransmission probability of the intermediate nodes is expressed as a function of the first-hop neighbors. Usually, two neighborhood den...

متن کامل

Traffic locality oriented route discovery algorithms for mobile ad hoc networks

II Abstract There has been a growing interest in Mobile Ad hoc Networks (MANETs) motivated by the advances in wireless technology and the range of potential applications that might be realised with such technology. Due to the lack of an infrastructure and their dynamic nature, MANETs demand a new set of networking protocols to harness the full benefits of these versatile communication systems. ...

متن کامل

Analyzing the Effect of Node Density on the Performance of the LAR-1P Algorithm

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called LAR-1P. Simulation results demonstrated that the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on a sub-network (zone) scale, the algo...

متن کامل

Impact of Routing Overhead in A Real-Time MANET Environment

Mobile Ad Hoc Network (MANETs) is collection of mobile/semi mobile nodes with no existing pre-established infrastructure, forming a temporary network. Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Another issue that effects the Q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1009.6052  شماره 

صفحات  -

تاریخ انتشار 2010